def Peter(n,l):
s=0
while True:
for i in range(len(l)):
s+=l[i]
if s>=n:
return i+1
n=int(input())
l=[int(i) for i in input().split()]
result=Peter(n,l)
print(result)
#include<bits/stdc++.h>
using namespace std;
int main(){
int pages;
cin>>pages;
int arr[7];
for(int i=0;i<7;i++){
cin>>arr[i];
}
int cnt=0;
int i=0;
while(pages>0){
pages=pages-arr[i%7];
i++;
cnt++;
}
if(cnt%7==0){
cout<<7<<endl;
}
else{
cout<<cnt%7<<endl;
}
return 0;
}1624C - Division by Two and Permutation | 1288A - Deadline |
1617A - Forbidden Subsequence | 914A - Perfect Squares |
873D - Merge Sort | 1251A - Broken Keyboard |
463B - Caisa and Pylons | 584A - Olesya and Rodion |
799A - Carrot Cakes | 1569B - Chess Tournament |
1047B - Cover Points | 1381B - Unmerge |
1256A - Payment Without Change | 908B - New Year and Buggy Bot |
979A - Pizza Pizza Pizza | 731A - Night at the Museum |
742A - Arpa’s hard exam and Mehrdad’s naive cheat | 1492A - Three swimmers |
1360E - Polygon | 1517D - Explorer Space |
1230B - Ania and Minimizing | 1201A - Important Exam |
676A - Nicholas and Permutation | 431A - Black Square |
474B - Worms | 987B - High School Become Human |
1223A - CME | 1658B - Marin and Anti-coprime Permutation |
14B - Young Photographer | 143A - Help Vasilisa the Wise 2 |